منابع مشابه
Simulation and verification of P systems through communicating X-machines.
The aim of this paper is to prove the suitability of a parallel distributed computational model, communicating X-machines, to simulate in a natural way a well established model of molecular computation, P systems, and to present some further benefits of the approach allowing us to check for some formal properties. A set of rules to transform any P system with symbol-objects into a communicating...
متن کاملCombined Power of X-machines and P Systems
An overview of the main interactions between X-machines and P systems is presented. It is shown how new variants of P systems can be obtained by using X-machines as internal structures of these systems. Conversions between these models are discussed and ways to test P systems using X-machine based testing techniques are described. Finally, some flexible methods to implement different P system s...
متن کاملPrinciples of Transforming Communicating X-Machines to Population P Systems
Population P Systems is a class of P Systems in which cells are arranged in a graph rather than a hierarchical structure. On the other hand, Communicating X-machines are state-based machines, extended with a memory structure and transition functions instead of simple inputs, which communicate via message passing. One could use Communicating X-machines to create system models built out of compon...
متن کاملP Systems with Replicated Rewriting and Stream X-Machines (Eilenberg Machines)
The aim of this paper is to show how the P systems with replicated rewriting can be modeled by X-machines (also called Eilenberg machines). In the first approach, the parallel behaviour of the regions of a P system is simulated by a sequential process involving a single X-machine. This allows the application of the X-machine testing procedures in order to prove the correctness of P systems. In ...
متن کاملSimulation and Verification of P Systems through Communicating X-machines P.Kefalas1, G.Eleftherakis1, M.Holcombe2 and M.Gheorghe2
The aim of this paper is to prove the suitability of a parallel distributed computational model, communicating X-machines, to simulate in a natural way a well established model of molecular computation, P systems, and to present some further benefits of the approach allowing us to check for some formal properties. A set of rules to transform any P system with symbol-objects into a communicating...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Natural Computing
سال: 2009
ISSN: 1567-7818,1572-9796
DOI: 10.1007/s11047-009-9110-7